An algorithm for matching non-deterministic services with operating guidelines
نویسندگان
چکیده
منابع مشابه
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SOA describe three roles of services, the service provider, the service requester, and the service broker, together with the three operations publish, find, and bind. We provide a formal method based on nondeterministic...
متن کاملMatching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. The service-oriented architecture (SOA) provides a general framework for service interaction. It describes three roles, service provider, service requester, and service broker, together with the operations publish, find, and bind. We provide a formal method based on nondeterministic automata to model service...
متن کاملNon-Deterministic Matching Algorithm for Net Transformations
Modeling and simulating dynamic systems require to represent their processes and the system changes within one model. To that effect, reconfigurable Petri nets consist of a place/transition net and a set of rules that can modify the Petri net. The application of a rule is based on finding a suitable match of the rule in the given net. This match is an isomorphic subnet that has to be located me...
متن کاملOperating guidelines for services
In a service-oriented world, the interaction of stateful services raises the need for formal verification of the behavioral compatibility of the services. In this thesis, we introduce a formal framework basing on Petri nets and automata for service modeling and formalize behavioral compatibility as deadlock freedom of the composition of the services. Many other research questions, like substitu...
متن کاملDeciding Substitutability of Services with Operating Guidelines
Deciding whether a service S can be substituted by another service S′ is an important problem in practice and one of the research challenges in service-oriented computing. In this paper, we define three substitutability notions for services. Accordance specifies that S′ cooperates with at least the environments that S cooperates with. S and S′ are equivalent if they cooperate with the same envi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Business Process Integration and Management
سال: 2007
ISSN: 1741-8763,1741-8771
DOI: 10.1504/ijbpim.2007.015129